A non-monotone alternating directional method for matrix recovery problem
نویسندگان
چکیده
منابع مشابه
Recovery Guarantee of Non-negative Matrix Factorization via Alternating Updates
Non-negative matrix factorization is a popular tool for decomposing data into feature and weight matrices under non-negativity constraints. It enjoys practical success but is poorly understood theoretically. This paper proposes an algorithm that alternates between decoding the weights and updating the features, and shows that assuming a generative model of the data, it provably recovers the gro...
متن کاملAlternating-directional Doubling Algorithm for M-Matrix Algebraic Riccati Equations
A new doubling algorithm—the alternating-directional doubling algorithm (ADDA)— is developed for computing the unique minimal nonnegative solution of an M -matrix algebraic Riccati equation (MARE). It is argued by both theoretical analysis and numerical experiments that ADDA is always faster than two existing doubling algorithms: SDA of Guo, Lin, and Xu (Numer. Math., 103 (2006), pp. 393–412) a...
متن کاملProximal Parallel Alternating Direction Method for Monotone Structured Variational Inequalities
In this paper, we focus on the alternating direction method, which is one of the most effective methods for solving structured variational inequalities(VI). In fact, we propose a proximal parallel alternating direction method which only needs to solve two strongly monotone sub-VI problems at each iteration. Convergence of the new method is proved under mild assumptions. We also present some pre...
متن کاملAlternating Recursive Method for Q-matrix Learning
The key issue affecting Cognitive Diagnostic Models (CDMs) is how to specify attributes and the Q-matrix. In this paper, we first attempt to use the Boolean Matrix Factorization (BMF) method to express conjunctive models in CDMs. Because BMF is an NPhard problem [2], we propose a recursive method that updates the attribute matrix (its rank equals to one) in each step. As Boolean algebra is irre...
متن کاملA Symmetry Preserving Alternating Projection Method for Matrix Model Updating
The Matrix Model Updating Problem (MMUP), considered in this paper, concerns updating a symmetric second-order finite element model so that the updated model reproduces a given set of desired eigenvalues and eigenvectors by replacing the corresponding ones from the original model, and preserves the symmetry of the original model. In an optimization setting, this is a constrained nonlinear optim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Mathematica
سال: 2020
ISSN: 1674-7216
DOI: 10.1360/ssm-2019-0183